منابع مشابه
On unit distances in a convex polygon
For any convex quadrilateral, the sum of the lengths of the diagonals is greater than the corresponding sum of a pair of opposite sides, and all four of its interior angles cannot be simultaneously acute. In this article, we use these two properties to estimate the number of unit distance edges in convex n-gons and we: (i) exhibit three large groups of cycles formed by unit distance edges that ...
متن کاملThe number of distinct distances from a vertex of a convex polygon
Erdős conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least bn/2c distinct distances to the other points of P . The best known lower bound due to Dumitrescu (2006) is 13n/36−O(1). In the present note, we slightly improve on this result to (13/36 + ε)n − O(1) for ε ≈ 1/23000. Our main ingredient is an improved bound on the maximum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.10.009